A Geometric Buchberger Algorithm for Integer Programming
نویسندگان
چکیده
منابع مشابه
A Geometric Buchberger Algorithm for Integer Programming
Let IP denote the family of integer programs of the form Min cx : Ax = b, x 2 N n obtained by varying the right hand side vector b but keeping A and c xed. A test set for IP is a set of vectors in Z n such that for each non-optimal solution to a program in this family, there is at least one element g in this set such that ? g has an improved cost value as compared to. We describe a unique minim...
متن کاملMinimised Geometric Buchberger Algorithm for Integer Programming
Recently, various algebraic integer programming (IP) solvers have been proposed based on the theory of Gröbner bases. The main difficulty of these solvers is the size of the Gröbner bases generated. In algorithms proposed so far, large Gröbner bases are generated by either introducing additional variables or by considering the generic IP problem IPA,C . Some improvements have been proposed such...
متن کاملA Variant of the Buchberger Algorithm for Integer Programming
In this paper we modify Buchberger’s S-pair reduction algorithm for computing a Gröbner basis of a toric ideal so as to apply to an integer program in inequality form with fixed right hand sides and fixed upper bounds on the variables. We formulate the algorithm in the original space and interpret the reduction steps geometrically. In fact, three variants of this algorithm are presented and we ...
متن کاملVariant of the Buchberger Algorithm for Integer Programming
In this paper we modify Buchberger's 5-pair reduction algorithm for computing a Gröbner basis of a toric ideal so as to apply to an integer program in inequality form with fixed right hand sides and fixed upper bounds on the variables. We formulate the algorithm in the original space and interpret the reduction steps geometrically. In fact, three variants of this algorithm are presented and we ...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1995
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.20.4.864